A CGM/BSP Parallel Similarity Algorithm
نویسندگان
چکیده
We present a CGM/BSP algorithm for computing an alignment (or string editing) between two strings A and C, with jAj = m and jCj = n. The algorithm requires O(p) communication rounds and O( p ) local computing time, on a distributed memory parallel computer of p processors each with O(nm=p) memory. We also present implementation results obtained on Beowulf machine with 64 nodes. Topic of interest: Algorithms and applications in Bioinformatics
منابع مشابه
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
Given two strings X and Y of lengths m and n, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to X and any substring of Y . The sequential algorithm takes O(mn) time and O(n) space. We present a parallel algorithm for ALCS on a coarse-grained multicomputer (BSP/CGM) model with p < p m processors that takes O(mn=p) time an...
متن کاملParallel Algorithm for Maximum Weight Matching in Trees
Unfortunately, theoretical results from PRAM algorithms do not necessarily match the speedups observed on real parallel machines. In this paper, we present a parallel algorithm that is more practical in that the assumption and cost model used reflect better the reality of commercially available multiprocessors. More precisely, we will use a version of the BSP model [6], referred to as the coars...
متن کاملAn Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem
This study focuses on the parallel resolution of the matrix chain ordering problem and the optimal convex polygon triangulation problem on the Coarse grain multicomputer model (CGM for short). There has been intensive work on the parallelization of these dynamic programming problems in PRAM, including the use of systolic arrays, but a BSP/CGM solution is necessary for ease of implementation and...
متن کاملEfficient BSP/CGM Algorithms for Text Retrieval
In this paper we present efficient, scalable and portable parallel algorithms written in the Coarse-Grained Multicomputer (CGM) and the Bulk Synchronous Parallel (BSP) models for the off-line clustering, the on-line retrieval and the update phases of the text retrieval problem based on the vector space model and using clustering to organize and handle a dynamic document collection. To the best ...
متن کاملBSP/CGM Algorithms for the Transitive Closure Problem
We present new implementations of BSP/CGM algorithms for the Transitive Closure Problem. Our strategies deal with size of the message and communication rounds, problems that cause inefficiency in the implementations of the transitive closure algorithms. The algorithms were implemented using LAM/MPI in two Beowulfs. The implementation results show the efficiency and scalability of the presented ...
متن کامل